Joint Source, Channel Coding, and Secrecy
نویسندگان
چکیده
We introduce the concept of joint source coding, channel coding, and secrecy. In particular, we propose two practical joint schemes: the first one is based on error-correcting randomized arithmetic codes, while the second one employs turbo codes with compression, error protection, and securization capabilities. We provide simulation results on ideal binary data showing that the proposed schemes achieve satisfactory performance; they also eliminate the need for external compression and ciphering blocks with a significant potential computational advantage.
منابع مشابه
Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملJoint Source-Channel Secrecy Using Analog Coding: Towards Secure Source Broadcast
This paper investigates joint source-channel secrecy for Gaussian broadcast communication in Shannon cipher system. We use a recently proposed secrecy measure, list secrecy, to measure secrecy, in which an eavesdropper is allowed to produce a list of reconstruction sequences and the secrecy is measured by the minimum distortion over the entire list. For achievability part, we propose a novel jo...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملSecrecy from Resolvability
We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper’s channel, we consider resolvability-based constructions, which associate to each message...
متن کاملCoding for Relay Networks and Effective Secrecy for Wire-tap Channels
This thesis addresses two problems of network information theory: coding for relay networks and (accurate) approximations of distributions based on unnormalized informational divergence with applications to network security. For the former problem, we first consider short message noisy network coding (SNNC). SNNC differs from long message noisy network coding (LNNC) in that one transmits many s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Information Security
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007